#include<bits/stdc++.h>
using namespace std;
#define MAX 100005
int a[MAX],visited[MAX];
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",a+i);
        visited[i]=0;
    }
    sort(a,a+n);
    /*for(int i=0;i<n;i++){
        cout<<a[i]<<" ";
    }cout<<endl;*/
    int flag=0,pre=0,ans=0;
    for(int i=0;i<n;i++){
        if(i==0)continue;
        if(a[i]>a[pre]){
            visited[i]=1;
            pre++;
        }
    }
    printf("%d\n",n-pre);
    return 0;
}